SR-SFLL: Structurally Robust Stripped Functionality Logic Locking

Combinators and Structurally Free Logic

A “Kripke-style” semantics is given for combinatory logic using frames with a ternary accessibility relation, much as in the Routley-Meyer semantics for relevance logic. We prove by algebraic means a completeness theorem for combinatory logic, by proving a representation theorem for “combinatory posets.” A philosophical interpretation is given of the models, showing that an element of a combina...

Structurally robust control of complex networks.

Robust control theory has been successfully applied to numerous real-world problems using a small set of devices called controllers. However, the real systems represented by networks contain unreliable components and modern robust control engineering has not addressed the problem of structural changes on complex networks including scale-free topologies. Here, we introduce the concept of structu...

Structurally robust biological networks Additional File

Mitigating SAT Attack on Logic Locking

Logic locking is a technique that has been proposed to protect outsourced IC designs from piracy and counterfeiting by untrusted foundries. A locked IC preserves the correct functionality only when a correct key is provided. Recently, the security of logic locking is threatened by a new attack called SAT attack, which can decipher the correct key of most logic locking techniques within a few ho...

Robust quantum data locking from phase modulation

Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use. The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Quantum data locking is a uniquely quantum phenomenon that allows a relatively short key of constant size to (un)lo...